Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations

Generalised Soundness of Workflow Nets Is Decidable

Verifying Generalized Soundness of Workflow Nets

Structural soundness of workflow nets is decidable

The problem of deciding whether a given workflow net is k-sound for some k 1 is known as structural soundness. We prove that structural soundness of workflow nets is decidable.  2005 Elsevier B.V. All rights reserved.

Soundness of Workflow Nets with Reset Arcs

Petri nets are often used to model and analyze workflows. Many workflow languages have been mapped onto Petri nets in order to provide formal semantics or to verify correctness properties. Typically, the so-called Workflow nets are used to model and analyze workflows and variants of the classical soundness property are used as a correctness notion. Since many workflow languages have cancelation...

Visualizing the Soundness of Workflow Nets

Petri nets and in particular workflow nets as a process description language allow the application of formal verification methods, e.g., to prove soundness. Although tools for soundness checks do already exist , it is still difficult for the workflow designer to correct the process model according to the output of these tests – mostly because diagnostic messages are not directly linked to the g...